A plane, arcwise connected and connected im kleinen point set which is not strongly connected im kleinen
نویسندگان
چکیده
منابع مشابه
Colouring Arcwise Connected Sets in the Plane II
Let G be the family of nite collections S where S is a collection of closed, bounded, arcwise connected sets in R 2 which for any S; T 2 S where S \ T 6 = ;, it holds that S \ T is arcwise connected. Given S 2 G which is triangle-free, we show that provided S is suu-ciently large there exists a subcollection S 0 S of at most 5 sets with the property that the sets of S surrounded by S 0 induce a...
متن کاملColouring Arcwise Connected Sets in the Plane I
Let G be the family of ®nite collections S where S is a collection of bounded, arcwise connected sets in R which for any S;T A S where S VT 0h, it holds that S VT is arcwise connected. We investigate the problem of bounding the chromatic number of the intersection graph G of a collection S A G. Assuming G is triangle-free, suppose there exists a closed Jordan curve C HR such that C intersects a...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملStrongly Connected Multivariate Digraphs
Generalizing the idea of viewing a digraph as a model of a linear map, we suggest a multi-variable analogue of a digraph, called a hydra, as a model of a multi-linear map. Walks in digraphs correspond to usual matrix multiplication while walks in hydras correspond to the tensor multiplication introduced by Robert Grone in 1987. By viewing matrix multiplication as a special case of this tensor m...
متن کاملTwinless Strongly Connected Components
Tarjan [9], describes how depth first search can be used to identify Strongly Connected Components (SCC) of a directed graph in linear time. It is standard to study Tarjan’s SCC algorithm in most senior undergraduate or introductory graduate computer science algorithms courses. In this paper we introduce the concept of a twinless strongly connected component (TSCC) of a directed graph. Loosely ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1932
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1932-05440-4